- path compression
- сжатие путём (алгоритм обработки узлов для нахождения остовного дерева)
Англо-русский словарь промышленной и научной лексики. 2014.
path compression
Смотреть что такое "path compression" в других словарях:
Compression driver — A compression driver is a type of loudspeaker driver which uses the technique of compression to achieve high efficiencies. In this context compression refers to the fact that the area of the loudspeaker diaphragm is significantly larger than the… … Wikipedia
Path Finder — Infobox Software name = Path Finder caption = developer = Cocoatech latest release version = 4.8.5 latest release date = April 30, 2008 operating system = Mac OS X genre = File browser license = Shareware website = [http://www.cocoatech.com/pf4/… … Wikipedia
Dynamic range compression — This article is about a process that intentionally reduces the dynamic range of audio signals. For similar reductions caused by circuit imperfections, see Gain compression. For processes that reduce the size of digital audio files, see Audio… … Wikipedia
The Path to 9/11 — was a two part miniseries that aired in the United States on ABC television from September 10 ndash; 11, 2006, and also in other countries. The film dramatizes the 2001 terrorist attack upon the World Trade Center in New York City and the events… … Wikipedia
Protected Media Path — The Protected Media Path is a set of technologies creating a Protected Environment, first included in Microsoft s Windows Vista operating system, that is used to enforce digital rights management (or DRM) protections on content. Its subsets are… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
Tarjan's off-line least common ancestors algorithm — In computer science, Tarjan s off line least common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union find data structure. The least common ancestor of two nodes d and e in… … Wikipedia
Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… … Wikipedia
Suite de Davenport-Schinzel — En combinatoire, une suite de Davenport Schinzel est une suite de symboles dans laquelle le nombre de fois où deux symboles peuvent apparaître en alternance est limité. La longueur d une suite de Davenport Schinzel est limitée par le nombre de… … Wikipédia en Français
Seal (mechanical) — Compression seal example A mechanical seal is a device which helps join systems or mechanisms together by preventing leakage (e.g., in a plumbing system), containing pressure, or excluding contamination. The effectiveness of a seal is dependent… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
